Enumerating Answers to First-Order Queries over Databases of Low Degree

A class of relational databases has low degree if for all $\delta>0$, but finitely many in the have at most $n^{\delta}$, where $n$ is size database. Typical examples are bounded or by $\log n$. It known that over a having degree, first-order boolean queries can be checked pseudo-linear time, i.e.\ $\epsilon>0$ time $n^{1+\epsilon}$. We generalize this result considering query evaluation. show counting number answers to done and after preprocessing we test constant whether given tuple solution enumerate with delay.